An ant colony system for permutation flow-shop sequencing

Ant colony system (ACS) is a novel meta-heuristic inspired by the foraging behavior of real ant. This paper is the 2rst to apply ACS for the n=m=P=Cmax problem, an NP-hard sequencing problem which is used to 2nd a processing order of n di6erent jobs to be processed on m machines in the same sequence with minimizing the makespan. To verify the developed ACS algorithm, computational experiments are conducted on the well-known benchmark problem set of Taillard. The ACS algorithm is compared with other mata-heuristics such as genetic algorithm, simulated annealing, and neighborhood search from the literature. Computational results demonstrate that ACS is a more e6ective mata-heuristic for the n=m=P=Cmax problem. ? 2003 Elsevier Ltd. All rights reserved.